A Novel Steganographic Protocol from Error-correcting Codes

The idea of ”Matrix encoding” was introduced in steganography by Crandall in 1998 [6]. The implementation was then proposed by Westfeld with steganography algorithm F5 [1]. The objective is to transmit a message within an image via the modified image, but with the constraint of minimizing the number of coefficients of the image changed. In this paper, new construction of protocol steganography is considered, it is an extension of the error correcting code and steganography construction. The proposed method consists of use the Majority logic decoding introduced in [5], for embedding the message in the cover image, the extraction function is always based on syndrome coding. An asymptoticly tight bound on the performance of embedding schemes is given.